Budgeted sensor placement for source localization on trees
نویسندگان
چکیده
منابع مشابه
Budgeted sensor placement for source localization on trees
This paper considers the problem of source localization on graphs. We assume that a diffusion process on a graph is partially observed, i.e., that only the time at which some of the vertices are reached by the diffusion is known, and we want to identify the vertex that initiated the diffusion. In particular, we address the problem of choosing a fixed number of sensor vertices based on whose dif...
متن کاملSensor Placement for Isotropic Source Localization
This paper proposes a sensor placement method for three-dimensional point source localization using multiple sensors. An observation model of multiple sensors and one source of unknown position is introduced. Given that model, the minimum number of sensors needed to localize the source is determined, and an optimal sensor placement is derived. The placement is optimal in the sense that it minim...
متن کاملSource localization and sensor placement in environmental monitoring
In this paper we discuss two closely related problems arising in environmental monitoring. The first is the source localization problem linked to the question How can one find an unknown “contamination source”? The second is an associated sensor placement problem: Where should we place sensors that are capable of providing the necessary “adequate data” for that? Our approach is based on some co...
متن کاملBack To The Source: An Online Approach for Sensor Placement and Source Localization
Source localization, the act of finding the originator of a disease or rumor in a network, has become an important problem in sociology and epidemiology. The localization is done using the infection state and time of infection of a few designated sensor nodes; however, maintaining sensors can be very costly in practice. We propose the first online approach to source localization: We deploy a pr...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.07.012